A Discretization Algorithm Based on Extended Gini Criterion
نویسندگان
چکیده
منابع مشابه
A Family of Correlation Coefficients Based on Extended Gini
The extended Gini is a family of measures of variability which is mainly used in the areas of finance and income distribution. Each index in the family is defined by specifying one parameter. The higher the parameter, the more weight is attached to the lower portion of the cumulative distribution. In this paper we list and investigate the properties of the equivalents of the correlation coeffic...
متن کاملA Discretization Algorithm Based on Cultural Immune Algorithm
Now more and more researchers pay attention to discretization of the continuous attributes. A hybrid evolutionary system based on immune algorithm and cultural algorithm is proposed for discretization which combines the strengths of evolutionary computing, social computing in this paper. It uses the cultural algorithm framework in which the immune algorithm embedded. Immune algorithm discretize...
متن کاملA discretization algorithm based on Class-Attribute Contingency Coefficient
Discretization algorithms have played an important role in data mining and knowledge discovery. They not only produce a concise summarization of continuous attributes to help the experts understand the data more easily, but also make learning more accurate and faster. In this paper, we propose a static, global, incremental, supervised and top-down discretization algorithm based on Class-Attribu...
متن کاملSSV Criterion Based Discretization for Naive Bayes Classifiers
Decision tree algorithms deal with continuous variables by finding split points which provide best separation of objects belonging to different classes. Such criteria can also be used to augment methods which require or prefer symbolic data. A tool for continuous data discretization based on the SSV criterion (designed for decision trees) has been constructed. It significantly improves the perf...
متن کاملExtended Fisher Criterion Based on Auto-correlation Matrix Information
Fisher’s linear discriminant analysis (FLDA) has been attracting many researchers and practitioners for several decades thanks to its ease of use and low computational cost. However, FLDA implicitly assumes that all the classes share the same covariance: which implies that FLDA might fail when thhis assumption is not necessarily satisfied. To overcome this problem, we propose a simple extension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Learning and Computing
سال: 2012
ISSN: 2010-3700
DOI: 10.7763/ijmlc.2012.v2.115